A SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Authors
Abstract:
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters to find their detour index.
similar resources
A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
full textOn Detour Index
The detour index of a connected graph is defined as the sum of the detour distances (lengths of longest paths) between unordered pairs of vertices of the graph. We give bounds for the detour index, determine the graphs with minimum and maximum detour indices respectively in the class of n-vertex unicyclic graphs with cycle length r, where 3 ≤ r ≤ n−2, and the graphs with the first, the second a...
full textComputing the Detour of Polygons
Let P be a simple polygon in 2 with n vertices. The detour of P between two points, p, q ∈ P , is the length of a shortest path contained in P and connecting p to q, divided by the distance of these points. The detour of the whole polygon is the maximum detour between any two points in P . We first analyze properties of pairs of points with maximum detour. Next, we use these properties to achie...
full textOn edge detour index polynomials
The edge detour index polynomials were recently introduced for computing the edge detour indices. In this paper we find relations among edge detour polynomials for the 2-dimensional graph of $TUC_4C_8(S)$ in a Euclidean plane and $TUC4C8(S)$ nanotorus.
full textAn algorithm for computing simple k-factors
Abstract A k-factor of graph G is defined as a k-regular spanning subgraph of G. For instance, a 2-factor of G is a set of cycles that span G. 2-factors have multiple applications in Graph Theory, Computer Graphics, and Computational Geometry [5, 4, 6, 11]. We define a simple 2-factor as a 2-factor without degenerate cycles. In general, simple k-factors are defined as k-regular spanning subgrap...
full textA Simple Algorithm for Computing Topological Indices of Dendrimers
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
full textMy Resources
Journal title
volume 2 issue None
pages 25- 28
publication date 2007-11
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023